Beyond stabilizer codes II: Clifford codes
نویسندگان
چکیده
منابع مشابه
Beyond stabilizer codes II: Clifford codes
Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group has an abelian index group. In particular, if the errors are modelled by tensor products of Pauli matrices, then the associated Cli...
متن کاملBeyond Stabilizer Codes
Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group is given by an extraspecial p-group. Suppose that the abstract error group has an abelian index group, then we show that a Clifford...
متن کاملQuantum Stabilizer Codes and beyond A
Quantum Stabilizer Codes and Beyond. (August 2008) Pradeep Kiran Sarvepalli, B.Tech., Indian Institute of Technology, Madras; M.S., Texas A&M University Chair of Advisory Committee: Dr. Andreas Klappenecker The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. Despite the large body of literature in quantum coding theory, many ...
متن کاملBeyond stabilizer codes I: Nice error bases
Nice error bases have been introduced by Knill as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with abelian index groups. We show that in general an index group of a nice error basis is necessarily solvable.
متن کاملQuantum Stabilizer Codes and Classical Linear Codes
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result—which applies to degenerate as well as nondegenerate codes— previously established necessary conditions for classical linear codes can be easily translated into ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2002
ISSN: 0018-9448
DOI: 10.1109/tit/2002.800473